Extended Abstract: An Improved Priority Function for Bidirectional Heuristic Search
نویسندگان
چکیده
Guni Sharon Computer Science University of Texas at Austin Austin, Texas, U.S.A ([email protected]) Robert C. Holte Computing Science Dept. University of Alberta Edmonton, Canada T6G 2E8 ([email protected]) Ariel Felner Information Systems Engineering Ben-Gurion University Beer-sheva, Israel ([email protected]) Nathan R. Sturtevant Computer science University of Denver Denver, Colorado, USA ([email protected])
منابع مشابه
Target-Value Search Revisited (Extended Abstract)
This paper addresses the Target-Value Search (TVS) problem, which is the problem of finding a path between two nodes in a graph whose cost is as close as possible to a given target value T . This problem has been previously addressed only for directed acyclic graphs. In this work we develop the theory required to solve this problem optimally for any type of graphs. We modify traditional heurist...
متن کاملDiploma Thesis - Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
We present a route planning technique solely based on the concept of node contraction. We contract or remove one node at a time out of the graph and add shortcut edges to the remaining graph to preserve shortest paths distances. The resulting contraction hierarchy (CH), the original graph plus shortcuts, also defines an order of “importance” among all nodes through the node selection. We apply ...
متن کاملBidirectional Search That Is Guaranteed to Meet in the Middle: Extended Version
We present MM, the first bidirectional heuristic search algorithm whose forward and backward searches are guaranteed to “meet in the middle”, i.e. never expand a node beyond the solution midpoint. We also present a novel framework for comparing MM, A*, and brute-force search, and identify conditions favoring each algorithm. Finally, we present experimental results that support our theoretical a...
متن کاملImproved Cuckoo Search Algorithm for Global Optimization
The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...
متن کاملIncremental Heuristic Search for Planning with Temporally Extended Goals and Uncontrollable Events
Planning with temporally extended goals and uncontrollable events has recently been introduced as a formal model for system reconfiguration problems. An important application is to automatically reconfigure a real-life system in such a way that its subsequent internal evolution is consistent with a temporal goal formula. In this paper we introduce an incremental search algorithm and a search-gu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016